|
|
Registro Completo |
Biblioteca(s): |
Embrapa Unidades Centrais. |
Data corrente: |
31/03/1997 |
Data da última atualização: |
12/12/2007 |
Autoria: |
COSTA, M. M. do C. |
Afiliação: |
EMBRAPA-DIN. |
Título: |
Characterization of modal [action] logic. |
Ano de publicação: |
1990 |
Fonte/Imprenta: |
Londres: University of London, 1990 |
Páginas: |
257p. |
Idioma: |
Inglês |
Notas: |
Tese Doutorado. |
Conteúdo: |
The purpose of this thesis is to provide adequate conditions of provability- the so called characterization problem- for the modal [action] logic (M[A]L). M[A]L is a formal system to support formal requirements specification of real time/embedded systems designed and used by the FOREST project of the alvey software engineering directorate. The characterization problem is to be dealt with using two basic approaches: possible world structures on the semantics level and the semantic tableaux on the proof level.The development of the work follows the paradigm of starting with a more simple logic, the propositional M[A]L, and gradually adding components such as quantification, deontic operators, sorts and others. The use of formal systems is the central idea for the support of mechanized deduction in computer science. Modal and temporal logics may have a considerable role, but different areas of application use various combinations of quantification and modalities, and can lead to a generation of new logics (such as M[A]L). The result of this enterprise will depend heavily on the existence of suitable methods for providing adequate and efficient proof procedures for these formalisms. Traditionally, the semantic tableau method is considered to be very intuitive: so that one could start reasoning in terms of tableau and then extend the results to another system with different characteristics. In this thesis we affirm this tradition and we formulate evidences for its efficiency as well. This thesis constitutes... MenosThe purpose of this thesis is to provide adequate conditions of provability- the so called characterization problem- for the modal [action] logic (M[A]L). M[A]L is a formal system to support formal requirements specification of real time/embedded systems designed and used by the FOREST project of the alvey software engineering directorate. The characterization problem is to be dealt with using two basic approaches: possible world structures on the semantics level and the semantic tableaux on the proof level.The development of the work follows the paradigm of starting with a more simple logic, the propositional M[A]L, and gradually adding components such as quantification, deontic operators, sorts and others. The use of formal systems is the central idea for the support of mechanized deduction in computer science. Modal and temporal logics may have a considerable role, but different areas of application use various combinations of quantification and modalities, and can lead to a generation of new logics (such as M[A]L). The result of this enterprise will depend heavily on the existence of suitable methods for providing adequate and efficient proof procedures for these formalisms. Traditionally, the semantic tableau method is considered to be very intuitive: so that one could start reasoning in terms of tableau and then extend the results to another system with different characteristics. In this thesis we affirm this tradition and we formulate evidences for its efficiency as... Mostrar Tudo |
Palavras-Chave: |
Data processing; Lógica Modal; Lógica Temporal; Processamento de Dados; Real time; Tempo Real. |
Categoria do assunto: |
-- |
Marc: |
LEADER 02057nam a2200205 a 4500 001 1087266 005 2007-12-12 008 1990 bl uuuu m 00u1 u #d 100 1 $aCOSTA, M. M. do C. 245 $aCharacterization of modal [action] logic. 260 $aLondres: University of London$c1990 300 $a257p. 500 $aTese Doutorado. 520 $aThe purpose of this thesis is to provide adequate conditions of provability- the so called characterization problem- for the modal [action] logic (M[A]L). M[A]L is a formal system to support formal requirements specification of real time/embedded systems designed and used by the FOREST project of the alvey software engineering directorate. The characterization problem is to be dealt with using two basic approaches: possible world structures on the semantics level and the semantic tableaux on the proof level.The development of the work follows the paradigm of starting with a more simple logic, the propositional M[A]L, and gradually adding components such as quantification, deontic operators, sorts and others. The use of formal systems is the central idea for the support of mechanized deduction in computer science. Modal and temporal logics may have a considerable role, but different areas of application use various combinations of quantification and modalities, and can lead to a generation of new logics (such as M[A]L). The result of this enterprise will depend heavily on the existence of suitable methods for providing adequate and efficient proof procedures for these formalisms. Traditionally, the semantic tableau method is considered to be very intuitive: so that one could start reasoning in terms of tableau and then extend the results to another system with different characteristics. In this thesis we affirm this tradition and we formulate evidences for its efficiency as well. This thesis constitutes... 653 $aData processing 653 $aLógica Modal 653 $aLógica Temporal 653 $aProcessamento de Dados 653 $aReal time 653 $aTempo Real
Download
Esconder MarcMostrar Marc Completo |
Registro original: |
Embrapa Unidades Centrais (AI-SEDE) |
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
URL |
Voltar
|
|
Registro Completo
Biblioteca(s): |
Embrapa Recursos Genéticos e Biotecnologia. |
Data corrente: |
20/11/2007 |
Data da última atualização: |
10/07/2008 |
Tipo da produção científica: |
Resumo em Anais de Congresso |
Circulação/Nível: |
-- - -- |
Autoria: |
OLIVEIRA, R. S.; OLIVEIRA NETO, O. B.; EVANGELISTA, I. B. R.; COSTA, P. H. A.; PAES, N. S.; MUCHAGATA, I. S.; GURGEL, F. L.; DIAS, S. C.; ROCHA, T. L.; LIMA, L. M.; MATTAR, M. C. S.; GROSSI-DE-SÁ, M. F. |
Título: |
Transformação de plantas de algodão (Gossypium hirsutum var. BRS Cedro) resistente a insetos-praga. |
Ano de publicação: |
2006 |
Fonte/Imprenta: |
In: ENCONTRO DO TALENTO ESTUDANTIL DA EMBRAPA RECURSOS GENÉTICOS E BIOTECNOLOGIA, 11., 2006, Brasília, DF. Anais: resumos dos trabalhos. Brasília, DF: Embrapa Recursos Genéticos e Biotecnologia, 2006. |
Páginas: |
p. 94. |
Idioma: |
Português |
Palavras-Chave: |
BRS Cedro; Insetos-praga. |
Thesagro: |
Algodão; Biologia Molecular; Gossypium Hirsutum; Organismo Transgênico; Variedade Resistente. |
Categoria do assunto: |
-- |
URL: |
https://ainfo.cnptia.embrapa.br/digital/bitstream/CENARGEN/28384/1/tales2006.pdf
https://www.cenargen.embrapa.br/publica/talento/tales2006.pdf
|
Marc: |
LEADER 01096nam a2200325 a 4500 001 1188567 005 2008-07-10 008 2006 bl uuuu u00u1 u #d 100 1 $aOLIVEIRA, R. S. 245 $aTransformação de plantas de algodão (Gossypium hirsutum var. BRS Cedro) resistente a insetos-praga. 260 $aIn: ENCONTRO DO TALENTO ESTUDANTIL DA EMBRAPA RECURSOS GENÉTICOS E BIOTECNOLOGIA, 11., 2006, Brasília, DF. Anais: resumos dos trabalhos. Brasília, DF: Embrapa Recursos Genéticos e Biotecnologia$c2006 300 $ap. 94. 650 $aAlgodão 650 $aBiologia Molecular 650 $aGossypium Hirsutum 650 $aOrganismo Transgênico 650 $aVariedade Resistente 653 $aBRS Cedro 653 $aInsetos-praga 700 1 $aOLIVEIRA NETO, O. B. 700 1 $aEVANGELISTA, I. B. R. 700 1 $aCOSTA, P. H. A. 700 1 $aPAES, N. S. 700 1 $aMUCHAGATA, I. S. 700 1 $aGURGEL, F. L. 700 1 $aDIAS, S. C. 700 1 $aROCHA, T. L. 700 1 $aLIMA, L. M. 700 1 $aMATTAR, M. C. S. 700 1 $aGROSSI-DE-SÁ, M. F.
Download
Esconder MarcMostrar Marc Completo |
Registro original: |
Embrapa Recursos Genéticos e Biotecnologia (CENARGEN) |
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
Fechar
|
Expressão de busca inválida. Verifique!!! |
|
|